Fundamental Dominations in Graphs
نویسندگان
چکیده
Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating elements is the corresponding fundamental domination number. It is observed that, for each nontrivial connected graph, at most five of these nine numbers can be different, and inequalities between these five numbers are given. Finally, these fundamental dominations are interpreted in terms of the total graph of the given graph, a concept introduced by the second author in 1965. It is argued that the very first domination concept, defined by O. Ore in 1962 and under a different name by C. Berge in 1958, deserves 1 ar X iv :0 80 8. 40 22 v1 [ m at h. C O ] 2 9 A ug 2 00 8 to be called the most fundamental of graph dominations. Mathematics Subject Classification: 05C15
منابع مشابه
The Signed Edge-Domatic Number of a Graph
For a nonempty graph G = (V, E), a signed edge-domination of G is a function f : E(G) → {1,−1} such that ∑e′∈NG [e] f (e′) ≥ 1 for each e ∈ E(G). The signed edge-domatic number of G is the largest integer d for which there is a set { f1, f2, . . . , fd} of signed edge-dominations of G such that ∑d i=1 fi (e) ≤ 1 for every e ∈ E(G). This paper gives an original study on this concept and determin...
متن کاملThe bondage numbers and efficient dominations of vertex-transitive graphs
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number.A dominating setD is called an efficient dominating set ofG if |N−[v]∩D|=1 for every vertex v ∈ V (G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the ...
متن کاملOn Perfect and Quasiperfect Dominations in Graphs∗
A subset S ⊆ V in a graph G = (V,E) is a k-quasiperfect dominating set (for k ≥ 1) if every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by γ 1k (G). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a dec...
متن کاملAbsorption Time of the Moran Process
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to become extinct. It is known that the expected absorption time for an advantageous mutation is O(n) on an n-vertex undirected graph, which allows ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کامل